Note Erdős–Ko–Rado from intersecting shadows
نویسندگان
چکیده
A set system is called t-intersecting if every two members meet each other in at least t elements. Katona determined the minimum ratio of the shadow and the size of such families and showed that the Erdős– Ko–Rado theorem immediately follows from this result. The aim of this note is to reproduce the proof to obtain a slight improvement in the Kneser graph. We also give a brief overview of corresponding results.
منابع مشابه
Erdös-Ko-Rado from intersecting shadows
A set system is called t-intersecting if every two members meet each other in at least t elements. Katona determined the minimum ratio of the shadow and the size of such families and showed that the Erdős–Ko–Rado theorem immediately follows from this result. The aim of this note is to reproduce the proof to obtain a slight improvement in the Kneser graph. We also give a brief overview of corres...
متن کاملTransference for the Erdős–ko–rado Theorem
For natural numbers n, r ∈ N with n ≥ r, the Kneser graph K(n, r) is the graph on the family of r-element subsets of {1, . . . , n} in which two sets are adjacent if and only if they are disjoint. Delete the edges of K(n, r) with some probability, independently of each other: is the independence number of this random graph equal to the independence number of the Kneser graph itself? We answer t...
متن کاملAn algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
In this paper we give a proof that the largest set of perfect matchings, in which any two contain a common edge, is the set of all perfect matchings that contain a fixed edge. This is a version of the famous Erdős-Ko-Rado theorem for perfect matchings. The proof given in this paper is algebraic, we first determine the least eigenvalue of the perfect matching derangement graph and use properties...
متن کاملShifting shadows: the Kruskal–Katona Theorem
As we have seen, antichains and intersecting families are fundamental to Extremal Set Theory. The two central theorems, Sperner’s Theorem and the Erdős–Ko–Rado Theorem, have inspired decades of research since their discovery, helping establish Extremal Set Theory as a vibrant and rapidly growing area of Discrete Mathematics. One must, then, pay a greater than usual amount of respect to the Krus...
متن کاملPartial Covering Arrays and a Generalized Erdős-Ko-Rado Property
The classical Erdős-Ko-Rado theorem states that if k ≤ ⌊n/2⌋ then the largest family of pairwise intersecting k-subsets of [n] = {0, 1, . . . , n} is of size ( n−1 k−1 ) . A family of k subsets satisfying this pairwise intersecting property is called an EKR family. We generalize the EKR property and provide asymptotic lower bounds on the size of the largest family A of k-subsets of [n] that sat...
متن کامل